Hierarchical Termination ?
نویسنده
چکیده
From a practical perspective, it is important for programs to have modular correctness properties. Some (largely syntactic) su cient conditions are given here for the union of terminating rewrite systems to be terminating, particularly in the hierarchical case, when one of the systems makes no reference to functions de ned by the other.
منابع مشابه
Hierarchical termination revisited
During the past two decades, term rewriting has gained enormous importance in various fields of computer science. Among other things, term rewriting constitutes a Turing-complete computational model which is closely related to functional programming. In other words, term rewriting systems (TRSs) can be viewed as programs. It is a well-known programming paradigm in computer science that programs...
متن کاملHierarchical Clustering in Medical Document Collections: the BIC-Means Method
Hierarchical clustering of text collections is a key problem in document management and retrieval. In partitional hierarchical clustering, which is more efficient than its agglomerative counterpart, the entire collection is split into clusters and the individual clusters are further split until a heuristically-motivated termination criterion is met. In this paper, we define the BIC-means algori...
متن کاملProving Termination of Sequential Reduction Relation using Tree Automata
The sequential reduction relation is a speciic rewrite relation, rewriting terms by separate normalisations w.r.t. several systems, or modules. When considering simple combinations of systems, like disjoint or con-structor sharing, termination (or weak termination) of each system implies termination of the sequential reduction relation. In the case of more complex combinations, like hierarchica...
متن کاملAutomated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules which allow us to perform termination proofs incrementally. Important results can be expressed in that new framework (regarding CE -termination for instance), and with help of extendable orderings, we give effective new i...
متن کاملLocally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineation
A clustering termination procedure which is locally adaptive (with respect to the hierarchical tree of sets representative of the agglomerative merging) is proposed, for agglomerative hierarchical clustering on a set equipped with a distance function. It represents a multi-scale alternative to conventional scale dependent threshold based termination criteria. We trim the tree at specific locati...
متن کاملRecursive Path Orderings Can Also Be Incremental
In this paper the Recursive Path Ordering is adapted for proving termination of rewriting incrementally. The new ordering, called Recursive Path Ordering with Modules, has as ingredients not only a precedence but also an underlying ordering =B. It can be used for incremental (innermost) termination proofs of hierarchical unions by defining =B as an extension of the termination proof obtained fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995